Pavel Naumov On Modal Logics of Partial Recursive Functions
نویسنده
چکیده
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both of them semantically complete modal logics are described and decidability of these logics is established.
منابع مشابه
On Modal Logics of Partial Recursive Functions
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both...
متن کاملAttainable Knowledge
The article investigates an evidence-based semantics for epistemic logics in which pieces of evidence are interpreted as equivalence relations on the epistemic worlds. It is shown that the properties of knowledge obtained from potentially infinitely many pieces of evidence are described by modal logic S5. At the same time, the properties of knowledge obtained from only a finite number of pieces...
متن کاملLogic of subtyping
We introduce new modal logical calculi that describe subtyping properties of Cartesian product and disjoint union type constructors as well as mutually-recursive types defined using those type constructors. Basic Logic of Subtyping S extends classical propositional logic by two new binary modalities ⊗ and ⊕. An interpretation of S is a function that maps standard connectives into set-theoretica...
متن کاملNon-primitive recursive decidability of products of modal logics with expanding domains
We show that—unlike products of ‘transitive’ modal logics which are usually undecidable— their ‘expanding domain’ relativisations can be decidable, though not in primitive recursive time. In particular, we prove the decidability and the finite expanding product model property of bimodal logics interpreted in two-dimensional structures where one component—call it the ‘flow of time’—is • a finite...
متن کاملCoalition Power in Epistemic Transition Systems
The paper proposes a bimodal logic that describes an interplay between coalition strategies and distributed knowledge. Unlike the existing literature, the paper assumes that a strategy must be not only executable but also verifiable. That is, the strategy of a coalition should be based only on the information distributively known by the coalition and the coalition must be able to verify the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005